Solvable black-box group problems are low for PP

Improved Lowness Results for Solvable Black-box Group Problems

New Approaches in Black Box Group Theory

We introduce a new approach in black box group theory which deals with black box group problems in the category of black boxes and their morphisms. This enables us to enrich black box groups by actions of outer automorphisms such as Frobenius maps or graph automorphisms of simple groups of Lie type. As an application of this new technique, we present a number of new results, including a solutio...

Permutation Group Algorithms via Black Box

If a black box simple group is known to be isomorphic to a classical group over a field of known characteristic, a Las Vegas algorithm is used to produce an explicit isomorphism. This is used to upgrade all nearly linear time Monte Carlo permutation group algorithms to Las Vegas algorithms when the input group has no composition factor isomorphic to an exceptional group of Lie type or a 3-dimen...

The Complexity of Black-Box Ring Problems

We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a black-box oracle. We give a polynomial-time quantum algorithm to compute a basis representation for a given black-box ring. Using this result we obtain polynomial-time quantum algorithms for several natural computatio...

Solvable $L$-subgroup of an $L$-group

In this paper, we study the notion of solvable $L$-subgroup of an $L$-group and provide its level subset characterization and this justifies the suitability of this extension. Throughout this work, we have used normality of an $L$-subgroup of an $L$-group in the sense of Wu rather than Liu.